منابع مشابه
PDQRAP - Prioritized Distributed Queueing Random Access Protocol
A new MAC layer protocol, DQRAP (Distributed Queueing Random Access Protocol), provides performance with respect to throughput and delay that approaches that of an ideal protocol. This paper introduces PDQRAP, a prioritized version of DQRAP. Two formats, the Extra-bit and the Extra-slot, each a variation of the basic DQRAP are described. Simulation results are presented that show that under a t...
متن کاملDynamic Distributed Scheduling in Random Access Networks
We consider a model of random access (slotted-aloha-type) communication networks of general topology. Assuming that network links receive exogenous arrivals of packets for transmission, we seek dynamic distributed random access strategies whose goal is to keep all network queues stable. We prove that two dynamic strategies, which we collectively call queue length based random access (QRA), ensu...
متن کاملDistributed Random Convex Programming via Constraints Consensus
This paper discusses distributed approaches for the solution of random convex programs (RCP). RCPs are convex optimization problems with a (usually large) number N of randomly extracted constraints; they arise in several applicative areas, especially in the context of decision under uncertainty, see [2, 3]. We here consider a setup in which instances of the random constraints (the scenario) are...
متن کاملAnt-Inspired Density Estimation via Random Walks
Many ant species use distributed population density estimation in applications ranging from quorum sensing, to task allocation, to appraisal of enemy colony strength. It has been shown that ants estimate local population density by tracking encounter rates: The higher the density, the more often the ants bump into each other. We study distributed density estimation from a theoretical perspectiv...
متن کاملOnline Distributed Estimation via Adaptive Sensor Networks
The paper presents an online distributed estimation scheme over adaptive sensor networks. The objective of the algorithm is consistent with distributed least squares without prior assumptions on the uncertainties in the operating environment of the sensors or the quality of sensor observations. Specifically, it is assumed that the observation process is time-varying due to the sensor’s suscepti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2008.924652